Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
1 + x |
→ (0 + 1) + x |
| 2: |
|
0 + x |
→ x |
|
There are 2 dependency pairs:
|
| 3: |
|
1 +# x |
→ (0 + 1) +# x |
| 4: |
|
1 +# x |
→ 0 +# 1 |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006